<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Hard
  </div>
  <div>
   <h1 class="question_title">
    719. Find K-th Smallest Pair Distance
   </h1>
   <p>
    Given an integer array, return the k-th smallest
    <b>
     distance
    </b>
    among all the pairs. The distance of a pair (A, B) is defined as the absolute difference between A and B.
   </p>
   <p>
    <b>
     Example 1:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b>
nums = [1,3,1]
k = 1
<b>Output: 0</b> 
<b>Explanation:</b>
Here are all the pairs:
(1,3) -&gt; 2
(1,1) -&gt; 0
(3,1) -&gt; 2
Then the 1st smallest distance pair is (1,1), and its distance is 0.
</pre>
   <p>
    <b>
     Note:
    </b>
    <br>
   </p>
   <ol>
    <li>
     <code>
      2 &lt;= len(nums) &lt;= 10000
     </code>
     .
    </li>
    <li>
     <code>
      0 &lt;= nums[i] &lt; 1000000
     </code>
     .
    </li>
    <li>
     <code>
      1 &lt;= k &lt;= len(nums) * (len(nums) - 1) / 2
     </code>
     .
    </li>
   </ol>
  </div>
  <div>
   <h1 class="question_title">
    719. 找出第 k 小的距离对
   </h1>
   <p>
    给定一个整数数组，返回所有数对之间的第 k 个最小
    <strong>
     距离
    </strong>
    。一对 (A, B) 的距离被定义为 A 和 B 之间的绝对差值。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
<strong>输入：</strong>
nums = [1,3,1]
k = 1
<strong>输出：0</strong> 
<strong>解释：</strong>
所有数对如下：
(1,3) -&gt; 2
(1,1) -&gt; 0
(3,1) -&gt; 2
因此第 1 个最小距离的数对是 (1,1)，它们之间的距离为 0。
</pre>
   <p>
    <strong>
     提示:
    </strong>
   </p>
   <ol>
    <li>
     <code>
      2 &lt;= len(nums) &lt;= 10000
     </code>
     .
    </li>
    <li>
     <code>
      0 &lt;= nums[i] &lt; 1000000
     </code>
     .
    </li>
    <li>
     <code>
      1 &lt;= k &lt;= len(nums) * (len(nums) - 1) / 2
     </code>
     .
    </li>
   </ol>
  </div>
 </body>
</html>